Concurrency Detection on Finish-to-Start Activity Precedence Networks

نویسندگان

  • Rui Moutinho
  • Anabela Tereso
چکیده

We explore the finish-to-start precedence relations of project activities used in scheduling problems. From these relations, we devise a method to identify groups of activities that could execute concurrently, i.e. activities in the same group can all execute in parallel. The method derives a new set of relations to describe the concurrency. Then, it is represented by an undirected graph and the maximal cliques problem identifies the groups. We provide a running example with a project from our previous studies in resource constrained project cost minimization together with an example application on the concurrency detection method: the evaluation of the resource stress.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal NPV Project Scheduling with Fixed Work Content and Payment on Milestones

    Project scheduling   Net present value   We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a t...

متن کامل

Tropical optimization problems in project scheduling

We consider a project that consists of activities operating in parallel under various temporal constraints, including start-start, startfinish and finish-start precedence relations, early start, late start and late finish time boundaries, and due dates. Scheduling problems are formulated to find optimal schedules for the project under different optimality criteria to minimize, including the pro...

متن کامل

Real-time Optimistic Concurrency Control based on Transaction Finish Degree

Concurrency control is one of the main issues in the studies of real-time database systems. Optimistic concurrency control algorithms have the attractive properties of being non-blocking and deadlock-free. However, they have the problems of late conflict detection and transaction restarts. Although the number of transaction restarts is reduced by dynamic adjustment of serialization order in rea...

متن کامل

Asynchronous Operations in Distributed Concurrency Control

Distributed locking is commonly adopted for performing concurrency control in distributed systems. It incorporates additional steps for handling deadlocks. This activity is carried out by methods based on wait-for-graphs or probes. The present study examines detection of conflicts based on enhanced local processing for distributed concurrency control. In the proposed “edge detection” approach, ...

متن کامل

Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound

In this paper we study an extension of the classical Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing a further type of precedence constraints denoted as “Feeding Precedences” (FP). This kind of problem happens in that production planning environment, like make-to-order manufacturing, when the effort associated with the execution of an activ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015